Graph exploration by a finite automaton

BCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON

In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...

Piecemeal Graph Exploration by a Mobile Robot

We study how a mobile robot can learn an unknown environment in a piecemeal manner The robot s goal is to learn a complete map of its environment while satisfying the constraint that it must return every so often to its starting position for refueling say The environment is modeled as an arbitrary undirected graph which is initially unknown to the robot We assume that the robot can distinguish ...

The Nondeterministic Complexity of a Finite Automaton

We deene the nondeterministic complexity of a nite automaton and show that there exist, for any integer p 1, automata which need (k 1=p) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable M-subsets of a free monoid into a hierarchy whose members are indexed by polynomials, where M denotes the Min{Plus semiring.

Sampling a Two-way Finite Automaton

We study position sampling in a two-way nondeterministic finite automaton (2NFA) to measure information flow between state variables, based on the information-theoretic sampling technique proposed in [20]. We prove that for a 2NFA, the language generated by position sampling is regular. We also show that for a 2NFA, we can effectively find a vector of sampling positions that maximizes informati...

A Cons Apart Automaton Research Project Graph Automata on Galois Fields Specified by Matrix Graph